A multiply intersecting Erdos-Ko-Rado theorem - The principal case
نویسنده
چکیده
Let n,k,r and t be positive integers, and let [n] = {1,2, . . . ,n}. A family G ⊂ 2[n] is called r-wise t-intersecting if |G1∩·· ·∩Gr| ≥ t holds for all G1, . . . ,Gr ∈ G . Let us define a typical r-wise t-intersecting family Gi(n,r, t) and its k-uniform subfamily Fi(n,k,r, t), where 0 ≤ i ≤ ⌊n−t r ⌋, as follows: Gi(n,r, t) = {G ⊂ [n] : |G∩ [t + ri]| ≥ t +(r−1)i}, Fi(n,k,r, t) = Gi(n,r, t)∩ ([n] k ) .
منابع مشابه
Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
We study the possibility of the existence of a Katona type proof for the Erdős-Ko-Rado theorem for 2and 3-intersecting families of sets. An Erdős-Ko-Rado type theorem for 2-intersecting integer arithmetic progressions and a model theoretic argument show that such an approach works in the 2-intersecting case.
متن کاملErdos-Ko-Rado in Random Hypergraphs
Let 3 ≤ k < n/2. We prove the analogue of the Erdős-Ko-Rado theorem for the random k-uniform hypergraph Gk(n, p) when k < (n/2)1/3; that is, we show that with probability tending to 1 as n → ∞, the maximum size of an intersecting subfamily of Gk(n, p) is the size of a maximum trivial family. The analogue of the Erdős-Ko-Rado theorem does not hold for all p when k À n1/3. We give quite precise r...
متن کاملMultiply-intersecting families revisited
Motivated by the Frankl’s results in [11] (“Multiply-intersecting families,” J. Combin. Theory (B) 1991), we consider some problems concerning the maximum size of multiply-intersecting families with additional conditions. Among other results, we show the following version of the Erdős–Ko–Rado theorem: for all r ≥ 8 and 1≤ t ≤ 2r+1−3r−1 there exist positive constants ε and n0 such that if n > n0...
متن کاملErdös-Ko-Rado theorem with conditions on the maximal degree
A family 9 of distinct k-element subsets of the n-element set X is called intersecting if Fn F’ # @ holds for all F, F’ E 9. Erdos, Ko, and Rado proved that for n > 2k necessarily ) 9 ) < (1: :) holds, which is clearly best possible (take all k-sets through a fixed element). For a family 9, its maximum degree d(9) is the maximum number of sets in .P= containing any particular element of X. For ...
متن کاملErdos-Ko-Rado theorems for uniform set-partition systems
Two set partitions of an n-set are said to t-intersect if they have t classes in common. A k-partition is a set partition with k classes and a k-partition is said to be uniform if every class has the same cardinality c = n/k. In this paper, we prove a higher order generalization of the Erdős-Ko-Rado theorem for systems of pairwise t-intersecting uniform k-partitions of an n-set. We prove that f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010